Multi-Robot Path Planning by Predicting Structure in a Dynamic Environment
نویسندگان
چکیده
منابع مشابه
Multi-Robot Path Planning by Predicting Structure in a Dynamic Environment
Path planning for multiple mobile robots is complicated by the presence of a dynamic environment, in which obstacles and other robots are moving. Centralized approaches are too computationally intensive for real-time response. Decoupled approaches which perform individual preplanning, conflict resolution, and reactive obstacle avoidance for each robot, can be globally inefficient. We propose a ...
متن کاملOffline Smooth path planning for a mobile robot in dynamic environment using evolutionary multi-objective optimization
This paper studies the path planning problem for mobile robots to move smoothly and safely along a shorter curvature-constrained path in completely known dynamic environments. The cost of travel is defined by an obstacle-avoidance cost, which is designed as a weighted penetration depth to vertices of obstacles, and a length cost. The path is composed of a pre-specified number of cubic spiral se...
متن کاملCooperative Path Planning for Multi-Robot Systems in Dynamic Domains
A stationary robot in an assembly line expects to execute all its hard-coded movements without any collision. Its recognition is limited to its tasks and the corresponding area of operation. In case of a failure an alarm is given and it stops working until a human being corrects the fault. The assembly robot does not react independently, which is the exact opposite to autonomous mobile robots. ...
متن کاملDynamic Environment Robot Path Planning Using Hierarchical Evolutionary Algorithms
The problem of path planning deals with the computation of an optimal path of the robot, from source to destination, such that it does not collide with any obstacle on its path. In this paper we solve the problem of path planning separately in two hierarchies. The coarser hierarchy finds the path in a static environment consisting of the entire robotic map. The resolution of the map is reduced ...
متن کاملExploiting Subgraph Structure in Multi-Robot Path Planning
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon becomes intractable. In this paper we present a novel form of abstraction that allows us to plan much more efficiently. The key to this abstraction is the partitioning of the map into subgraphs of known structure with entry an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2000
ISSN: 1474-6670
DOI: 10.1016/s1474-6670(17)39203-0